A Recursive Formulation for Repeated Agency with History Dependence

نویسندگان

  • Ana Fernandes
  • Christopher Phelan
چکیده

There is now an extensive literature regarding the efficient design of incentive mechanisms in dynamic environments. Included in this literature are models with privately observed endowment shocks (Green [6], Thomas and Worrall [13], Phelan [9], Wang [15], among others), privately observed taste shocks (Atkeson and Lucas [2]) and privately observed effort levels (Spear and Srivastava [11], Phelan and Townsend [10], Phelan [8], Hopen-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Recursive Formulation for the Mixed Redundancy Strategy in Reliability Optimization Problems

One of the common approaches for improving the reliability of a specific system is to use parallel redundant components in subsystems. This approach, which is known as the redundancy allocation problem (RAP), includes the simultaneous selection of the component type and its level for each subsystem in order to maximize the system reliability.Traditionally, there are two redundancy strategies, n...

متن کامل

Degrees in $k$-minimal label random recursive trees

This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring

متن کامل

AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...

متن کامل

Dynamic mechanism design with hidden income and hidden actions

We develop general recursive methods to solve for optimal contracts in dynamic principal-agent environments with hidden states and hidden actions. In our baseline model, the principal observes nothing other than transfers. Nevertheless, optimal incentive-constrained insurance can be attained. Starting from a general mechanism with arbitrary communication, randomization, full history dependence,...

متن کامل

Application of Recursive Least Squares to Efficient Blunder Detection in Linear Models

In many geodetic applications a large number of observations are being measured to estimate the unknown parameters. The unbiasedness property of the estimated parameters is only ensured if there is no bias (e.g. systematic effect) or falsifying observations, which are also known as outliers. One of the most important steps towards obtaining a coherent analysis for the parameter estimation is th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Economic Theory

دوره 91  شماره 

صفحات  -

تاریخ انتشار 2000